Bounds for Jacobi and related polynomials derivable by matrix methods
نویسندگان
چکیده
منابع مشابه
Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials
Fast and effective algorithms are discussed for resumming matrix polynomials and Chebyshev matrix polynomials. These algorithms lead to a significant speed-up in computer time by reducing the number of matrix multiplications required to roughly twice the square root of the degree of the polynomial. A few numerical tests are presented, showing that evaluation of matrix functions via polynomial e...
متن کاملMultivariable Construction of Extended Jacobi Matrix Polynomials
The main aim of this paper is to construct a multivariable extension with the help of the extended Jacobi matrix polynomials (EJMPs). Generating matrix functions and recurrence relations satisfied by these multivariable matrix polynomials are derived. Furthermore, general families of multilinear and multilateral generating matrix functions are obtained and their applications are presented.
متن کاملMatrix-valued little q-Jacobi polynomials
Matrix-valued analogues of the little q-Jacobi polynomials are introduced and studied. For the 2 × 2-matrix-valued little q-Jacobi polynomials explicit expressions for the orthogonality relations, Rodrigues formula, three-term recurrence relation and its relation to matrix-valued q-hypergeometric series and the scalar-valued little q-Jacobi polynomials are presented. The study is based on the m...
متن کاملA class of matrix-valued polynomials generalizing Jacobi polynomials
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a two-step recurrence relation, integral inter-relations, and quasi-orthogonality relations. 1. Motivation The understanding of matrix-valued orthogonal polynomi...
متن کاملBounds for eigenvalues of matrix polynomials
Upper and lower bounds are derived for the absolute values of the eigenvalues of a matrix polynomial (or λ-matrix). The bounds are based on norms of the coefficient matrices and involve the inverses of the leading and trailing coefficient matrices. They generalize various existing bounds for scalar polynomials and single matrices. A variety of tools are used in the derivations, including block ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1974
ISSN: 0021-9045
DOI: 10.1016/0021-9045(74)90080-x